Semantics of (disjunctive) logic programs based on partial evaluation
نویسندگان
چکیده
منابع مشابه
Semantics of (disjunctive) Logic Programs Based on Partial Evaluation
We present a new and general approach for deening, understanding, and computing logic programming semantics. We consider disjunctive programs for generality, but our results are still interesting if specialized to normal programs. Our framework consists of two parts: (1) a semantical, where semantics are deened in an abstract way as the weakest semantics satisfying certain properties, and (2) a...
متن کاملProgression Semantics for Disjunctive Logic Programs
In this paper, we extend the progression semantics for firstorder disjunctive logic programs and show that it coincides with the stable model semantics. Based on it, we further show how disjunctive answer set programming is related to Satisfiability Modulo Theories.
متن کاملDomain-theoretic Semantics for Disjunctive Logic Programs
We propose three equivalent domain-theoretic semantics for dis-junctive logic programs in the style of Gelfond and Lifschitz. These are (i) a resolution-style inference semantics; (ii) a model-theoretic semantics; and (iii) a (nondeterministic) state-transition semantics. We show how these three semantics generalize \for free" to disjunctive logic programming over any Scott domain. We also rela...
متن کاملA Fixpoint Semantics for Disjunctive Logic Programs
D We present a fixpoint semantics for disjunctive logic programs. We extend the concept of the Herbrand base of a logic program to consist of all positive clauses that may be formed using the atoms in the Herbrand base. A monotonic closure operator is defined, operating on the lattice formed by the power set of the extended Herbrand base. The closure operator is shown to achieve a least fixpoin...
متن کاملDisjunctive Semantics based upon Partial and Bottom-Up Evaluation
We present a new and general approach of deening semantics for disjunc-tive logic programs. Our framework consists of two parts: (1) a semantical, where semantics are deened in an abstract way as the weakest semantics satisfying certain properties, and (2) a procedural, namely a bottom-up query-evaluation method based on operators working on conditional facts (introduced independently by Bry an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 1999
ISSN: 0743-1066
DOI: 10.1016/s0743-1066(98)10030-4